A Quadratic Basis Function, Quadratic Geometry, High Order Panel Method
نویسندگان
چکیده
Most panel method implementations use both low order basis function representations of the solution and flat panel representations of the body surface. Although several implementations of higher order panel methods exist, difficulties in robustly computing the self term integrals remain. In this paper, methods for integrating the single and double layer self term integrals are presented. The approaches are conceptually simple and robust. The paper considers quadratic basis functions to represent the solution, while the geometry of the body is approximated using piecewise parametric quadratic patches. Increased convergence rates are demonstrated for cases where the quadratic basis functions on quadratic curved panels are used. The quadratic panel method converges at a rate proportional to the cube of the panel side length (or NP− 3 2 , where NP is the number of panels).
منابع مشابه
A TRUST-REGION SEQUENTIAL QUADRATIC PROGRAMMING WITH NEW SIMPLE FILTER AS AN EFFICIENT AND ROBUST FIRST-ORDER RELIABILITY METHOD
The real-world applications addressing the nonlinear functions of multiple variables could be implicitly assessed through structural reliability analysis. This study establishes an efficient algorithm for resolving highly nonlinear structural reliability problems. To this end, first a numerical nonlinear optimization algorithm with a new simple filter is defined to locate and estimate the most ...
متن کاملInteractive multiple objective programming in optimization of the fully fuzzy quadratic programming problems
In this paper, a quadratic programming (FFQP) problem is considered in which all of the cost coefficients, constraints coefficients, and right hand side of the constraints are characterized by L-R fuzzy numbers. Through this paper, the concept of α- level of fuzzy numbers for the objective function, and the order relations on the fuzzy numbers for the constraints are considered. To optimize th...
متن کاملBivariate C1 Quadratic Finite Elements and Vertex Splines
Following work of Heindl and of Powell and Sabin, each triangle of an arbitrary (regular) triangulation A of a polygonal region ii in R is subdivided into twelve triangles, using the three medians, yielding the refinement A of A , so that C quadratic finite elements can be constructed. In this paper, we derive the Bézier nets of these elements in terms of the parameters that describe function a...
متن کاملPutting the curvature back into sparse solvers
Many problems in signal and image processing seek a sparse solution to an underdetermined linear system. A common problem formulation for such applications is the basis pursuit denoising problem. Many of the most used approaches for this problem – such as iterative soft thresholding and SPGL1 – are first-order methods. As a result, these methods can sometimes be slow to converge. In this paper,...
متن کاملThe use of inverse quadratic radial basis functions for the solution of an inverse heat problem
In this paper, a numerical procedure for an inverse problem of simultaneously determining an unknown coefficient in a semilinear parabolic equation subject to the specification of the solution at an internal point along with the usual initial boundary conditions is considered. The method consists of expanding the required approximate solution as the elements of the inverse quadrati...
متن کامل